Right Triangles with Algebraic Sides and Elliptic Curves over Number Fields
نویسنده
چکیده
Given any positive integer n, we prove the existence of infinitely many right triangles with area n and side lengths in certain number fields. This generalizes the famous congruent number problem. The proof allows the explicit construction of these triangles; for this purpose we find for any positive integer n an explicit cubic number field Q(λ) (depending on n) and an explicit point Pλ of infinite order in the Mordell-Weil group of the elliptic curve Y 2 = X − nX over Q(λ). 1. Congruent numbers over the rationals A positive integer n is called a congruent number if there exists a right triangle with rational sides and area equal to n, i.e., there exist a, b, c ∈ Q∗ with a + b = c and 1 2 ab = n. (1) It is easy to decide whether there is a right triangle of given area and integral sides (thanks to Euclid’s characterization of the Pythagorean triples). The case of rational sides, known as the congruent number problem, is not completely understood. Fibonacci showed that 5 is a congruent number (since one may take a = 3 2 , b = 20 3 and c = 41 6 ). Fermat found that 1, 2 and 3 are not congruent numbers. Hence, there is no perfect square amongst the congruent numbers since otherwise the corresponding rational triangle would be similar to one with area equal to 1. By the same reason one can restrict to square-free positive integers, a condition we will assume in the sequel. There is a fruitful translation of the congruent number problem into the language of elliptic curves. Suppose n is a congruent number. It follows from (1) that there exist three squares in arithmetic progression of distance n, namely x−n, x, x+n, where x = c/4. Therefore their product (x−n)x(x+ n) is again a rational square. In other words, a right triangle of area n and Date: March 26, 2009. 2000 Mathematics Subject Classification. Primary 11G05; Secondary 11A99. 1
منابع مشابه
Rational Triangles with Equal Area
We consider the set of triangles in the plane with rational sides and a given area A. We show there are infinitely many such triangles for each possible area A. We also show that infinitely many such triangles may be constructed from a given one, all sharing a side of the original triangle, unless the original is equilateral. There are three families of triangles (including the isosceles ones) ...
متن کاملElliptic Curves over Finite Fields
In this chapter, we study elliptic curves defined over finite fields. Our discussion will include the Weil conjectures for elliptic curves, criteria for supersingularity and a description of the possible groups arising as E(Fq). We shall use basic algebraic geometry of elliptic curves. Specifically, we shall need the notion and properties of isogenies of elliptic curves and of the Weil pairing....
متن کاملOn Integer Relations Between the Area and Perimeter of Heron Triangles
We discuss the relationship P 2 = nA for a triangle with integer sides, with perimeter P and area A, where n is an integer. We show that the problem reduces to finding rational points of infinite order in a family of elliptic curves. The geometry of the curves plays a crucial role in finding real triangles.
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملStudy of Finite Field over Elliptic Curve: Arithmetic Means
Public key cryptography systems are based on sound mathematical foundations that are designed to make the problem hard for an intruder to break into the system. Number theory and algebraic geometry, namely the theory of elliptic curves defined over finite fields, has found applications in cryptology. The basic reason for this is that elliptic curves over finite fields provide an inexhaustible s...
متن کامل